Bipartite graphs

Results: 105



#Item
81(Enumeration Results for) Signed Graphs Matthias Beck San Francisco State University [John Stembridge]

(Enumeration Results for) Signed Graphs Matthias Beck San Francisco State University [John Stembridge]

Add to Reading List

Source URL: math.nist.gov

Language: English - Date: 2014-09-04 14:50:31
82On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆

On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2008-10-14 11:56:16
83Bernoulli Graph Bounds for General Random Graphs∗ Carter T. Butts† Abstract General random graphs (i.e., stochastic models for networks incorporating heterogeneity

Bernoulli Graph Bounds for General Random Graphs∗ Carter T. Butts† Abstract General random graphs (i.e., stochastic models for networks incorporating heterogeneity

Add to Reading List

Source URL: www.imbs.uci.edu

Language: English - Date: 2014-11-04 13:01:45
84Beyond Graphs: Toward Scalable Hypergraph Analysis Systems ∗ Benjamin Heintz

Beyond Graphs: Toward Scalable Hypergraph Analysis Systems ∗ Benjamin Heintz

Add to Reading List

Source URL: www.sigmetrics.org

Language: English - Date: 2013-05-23 16:22:19
85CatchSync : Catching Synchronized Behavior in Large Directed Graphs Meng Jiang123 , Peng Cui123 , Alex Beutel4 , Christos Faloutsos4 , Shiqiang Yang123 1  2

CatchSync : Catching Synchronized Behavior in Large Directed Graphs Meng Jiang123 , Peng Cui123 , Alex Beutel4 , Christos Faloutsos4 , Shiqiang Yang123 1 2

Add to Reading List

Source URL: alexbeutel.com

Language: English - Date: 2014-07-24 03:43:29
86Hindawi Publishing Corporation The Scientific World Journal Volume 2013, Article ID[removed], 5 pages http://dx.doi.org[removed][removed]Research Article

Hindawi Publishing Corporation The Scientific World Journal Volume 2013, Article ID[removed], 5 pages http://dx.doi.org[removed][removed]Research Article

Add to Reading List

Source URL: downloads.hindawi.com

Language: English - Date: 2014-08-28 17:07:11
87Compressing graphs with semantic structure Elaine Angelino Abstract. Graph compression schemes are based on finding an ordering or clustering of nodes that places similar nodes close to one another. Existing algorithms f

Compressing graphs with semantic structure Elaine Angelino Abstract. Graph compression schemes are based on finding an ordering or clustering of nodes that places similar nodes close to one another. Existing algorithms f

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2014-03-30 22:03:59
88Unavoidable arrays ¨ Klas Markstr¨ om and Lars-Daniel Ohman Abstract. We investigate edge list-colourings of complete bipartite graphs, where the lists are shorter than the length guaranteed by Galvin’s theorem to al

Unavoidable arrays ¨ Klas Markstr¨ om and Lars-Daniel Ohman Abstract. We investigate edge list-colourings of complete bipartite graphs, where the lists are shorter than the length guaranteed by Galvin’s theorem to al

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:22
89OddBall: Spotting Anomalies in Weighted Graphs Leman Akoglu Mary McGlohon  Christos Faloutsos

OddBall: Spotting Anomalies in Weighted Graphs Leman Akoglu Mary McGlohon Christos Faloutsos

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2010-02-28 14:32:30
90The Room Connectivity Graph: Shape Retrieval in the Architectural Domain Raoul Wessel Ina Blümel

The Room Connectivity Graph: Shape Retrieval in the Architectural Domain Raoul Wessel Ina Blümel

Add to Reading List

Source URL: cg.cs.uni-bonn.de

Language: English - Date: 2010-10-06 10:04:59